A Binary Particle Swarm Optimizer With Priority Planning and Hierarchical Learning for Networked Epidemic Control
نویسندگان
چکیده
The control of epidemics taking place in complex networks has been an increasingly active topic public health management. In this article, we propose efficient networked epidemic system, where a modified susceptible-exposed-infected-vigilant (SEIV) model is first built to simulate spreading. Then, different from existing continuous resource models which abstractly map resources parameters models, concrete description real-world goods/services and their allocation. Based on the two cost-constraint subset selection problem identified. To solve problem, swarm-based stochastic optimization policy proposed, each particle swarm can determine its own solutions according guidance superior peers historical searching experience whole swarm, without extra problem-relative information. Theoretical proof about system equilibrium provided, consistent with experimental observations. competitive performance proposed optimizer validated by theoretical analysis comparison experiments. Finally, application case provided illustrate practicability.
منابع مشابه
Runtime analysis of a binary particle swarm optimizer
We investigate the runtime of a Binary Particle Swarm Optimizer (PSO) for optimizing pseudo-Boolean functions f : {0, 1}n → R. The Binary PSO maintains a swarm of particles searching for good solutions. Each particle consists of a current position from {0, 1}n, an own best position and a velocity vector used in a probabilistic process to update its current position. The velocities for a particl...
متن کاملA Parallel Particle Swarm Optimizer
1. Abstract Time requirements for the solving of complex large-scale engineering problems can be substantially reduced by using parallel computation. Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm Algorithm as a means of obtaining increased computat...
متن کاملA new Reinforcement Learning-based Memetic Particle Swarm Optimizer
Developing an effective memetic algorithm that integrates the Particle Swarm Optimization (PSO) algorithm and a local search method is a difficult task. The challenging issues include when the local search method should be called, the frequency of calling the local search method, as well as which particle should undergo the local search operations. Motivated by this challenge, we introduce a ne...
متن کاملA Learning Automata Approach to Cooperative Particle Swarm Optimizer
This paper presents a modification of Particle Swarm Optimization (PSO) technique based on cooperative behavior of swarms and learning ability of an automaton. The approach is called Cooperative Particle Swarm Optimization based on Learning Automata (CPSOLA). The CPSOLA algorithm utilizes three layers of cooperation which are intra swarm, inter swarm and inter population. There are two active p...
متن کاملA hierarchical particle swarm optimizer with latin sampling based memetic algorithm for numerical optimization
Memetic algorithms, one type of algorithms inspired by nature, have been successfully applied to solve numerous optimization problems in diverse fields. In this paper, we propose a new memetic computing model, using a hierarchical particle swarm optimizer (HPSO) and latin hypercube sampling (LHS) method. In the bottom layer of hierarchical PSO, several swarms evolve in parallel to avoid being t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE transactions on systems, man, and cybernetics
سال: 2021
ISSN: ['1083-4427', '1558-2426']
DOI: https://doi.org/10.1109/tsmc.2019.2945055